An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
نویسندگان
چکیده
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting a network with links of minimum total cost in order to make it edge-biconnected, i.e. the failure of a single link will never disconnect any two nodes. A new evolutionary algorithm is proposed that works directly on the set of additional links of a candidate solution. Problem-specific initialization, recombination, and mutation operators use a stochastic hill-climbing procedure. With low computational effort, only locally optimal, feasible candidate solutions are produced. Experimental results are significantly better than those of a previous genetic algorithm concerning final solutions’ qualities and especially execution times.
منابع مشابه
A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملEvolutionary algorithms for the edge biconnectivity augmentation problem
A graph is edge-biconnected i f i t requires the removal ofat least hvo edges to disconnect it. Assume that we have weighted graph that is not biconnected, and an additional set of augmentation edges. The (NP-hard) edge biconnectivify augmentafion problem is to select a minimal subset of the augmentation edges, whose inclusion will cause fhe graph to be biconnected. This paper explores the appl...
متن کاملA Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based vlsi layout, were investigated. These algorithms were run on a pvm cluster. The experiments show that the parallel approach does not bring faster computation but it does, however, much more importantl...
متن کاملA Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-biconnectivity augmentation (E2AUG) problem, in which a given graph G0(V, E0) needs to be augmented by the cheapest possible set of edges AUG so that a single edge deletion does not disconnect G0. The new approach is bas...
متن کاملHill-climbing Search in Evolutionary Models for Protein Folding Simulations
Evolutionary algorithms and hill-climbing search models are investigated to address the protein structure prediction problem. This is a well-known NP-hard problem representing one of the most important and challenging problems in computational biology. The pull move operation is engaged as the main local search operator in several approaches to protein structure prediction. The considered appro...
متن کامل